Error bounds for the modified Newton's method
نویسندگان
چکیده
منابع مشابه
Error Bounds on the SCISSORS Approximation Method
The SCISSORS method for approximating chemical similarities has shown excellent empirical performance on a number of real-world chemical data sets but lacks theoretically proven bounds on its worst-case error performance. This paper first proves reductions showing SCISSORS to be equivalent to two previous kernel methods: kernel principal components analysis and the rank-k Nyström approximation ...
متن کاملOptimal a priori error bounds for the Rayleigh-Ritz method
We derive error bounds for the Rayleigh-Ritz method for the approximation to extremal eigenpairs of a symmetric matrix. The bounds are expressed in terms of the eigenvalues of the matrix and the angle between the subspace and the eigenvector. We also present a sharp bound.
متن کاملA posteriori error bounds for the empirical interpolation method
We present rigorous a posteriori error bounds for the Empirical Interpolation Method (EIM). The essential ingredients are (i) analytical upper bounds for the parametric derivatives of the function to be approximated, (ii) the EIM “Lebesgue constant,” and (iii) information concerning the EIM approximation error at a finite set of points in parameter space. The bound is computed “offline” and is ...
متن کاملOutput Error Bounds for the Dirichlet-Neumann Reduced Basis Method
The Dirichlet-Neumann reduced basis method is a model order reduction method for homogeneous domain decomposition of elliptic PDE’s on a-priori known geometries. It is based on an iterative scheme with full offline-online decomposition and rigorous a-posteriori error estimates. We show that the primal-dual framework for non-compliant output quantities can be transferred to this method. The resu...
متن کاملEfficient Algorithms and Error Analysis for the Modified Nystrom Method
Lemma 8. Given an m × m symmetric matrix A and a target rank k, we let C1 contain the c1 columns of A selected by a column sampling algorithm such that the following inequality holds: ∥∥A− PC1A∥∥2F ≤ f∥∥A−Ak∥∥2F . Then we select c2 = kf −1 columns to construct C2 and c3 = (c1+ c2) −1 columns to construct C3, both using the adaptive sampling according to the residual B1 = A − PC1A and B2 = A − P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1976
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700025351